Large unavoidable subtournaments
نویسندگان
چکیده
منابع مشابه
Large Unavoidable Subtournaments
Let Dk denote the tournament on 3k vertices consisting of three disjoint vertex classes V1, V2 and V3 of size k, each oriented as a transitive subtournament, and with edges directed from V1 to V2, from V2 to V3 and from V3 to V1. Fox and Sudakov proved that given a natural number k and ǫ > 0 there is n0(k, ǫ) such that every tournament of order n ≥ n0(k, ǫ) which is ǫ-far from being transitive ...
متن کاملForcing large transitive subtournaments
The Erdős-Hajnal Conjecture states that for every given H there exists a constant c(H) > 0 such that every graph G that does not contain H as an induced subgraph contains a clique or a stable set of size at least |V (G)|c(H). The conjecture is still open. However some time ago its directed version was proved to be equivalent to the original one. In the directed version graphs are replaced by to...
متن کاملUnavoidable double - connected large
A connected graph is double-connected if its complement is also connected. The following Ramsey-type theorem is proved in this paper. There exists a function h(n), deened on the set of integers exceeding three, such that every double-connected graph on at least h(n) vertices must contain, as an induced subgraph, a special double-connected graph, which is either one of the following graphs or th...
متن کاملUnavoidable doubly connected large graphs
A connected graph is double connected if its complement is also connected The following Ramsey type theorem is proved in this paper There exists a function h n de ned on the set of integers exceeding three such that every double connected graph on at least h n vertices must contain as an induced subgraph a special double connected graph which is either one of the following graphs or the complem...
متن کاملUnavoidable minors of graphs of large type
In this paper, we study one measure of complexity of a graph, namely its type. The type of a graph G is deened to be the minimum number n such that there is a sequence of graphs G = G 0 , G 1 , : : : , G n , where G i is obtained by contracting one edge in or deleting one edge from each block of G i?1 , and where G n is edgeless. We show that a 3-connected graph has large type if and only if it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.06.098